Intersection types and λ-definability
نویسندگان
چکیده
منابع مشابه
INTERSECTION TYPES FOR λ Gtz - CALCULUS
We introduce an intersection type assignment system for EspiritoSanto’s λGtz-calculus, a term calculus embodying the Curry–Howard correspondence for the intuitionistic sequent calculus. We investigate basic properties of this intersection type system. Our main result is Subject reduction property.
متن کاملComputability and λ-Definability
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your perso...
متن کاملReduction vs Intersection / Union Types in λ μ μ̃
This paper studies intersection and union type assignment for the calculus λμμ̃ [6], a proofterm syntax for Gentzen’s classical sequent calculus. We show that this notion is closed for subject-expansion, and show that it needs to be restricted to satisfy subject-reduction as well, even when limiting reduction to (confluent) call-by-name or call-by-value reduction, making it unsuitable to define ...
متن کاملCompositional Characterisations of λ-terms using Intersection Types ?
We show how to characterise compositionally a number of evaluation properties of λ-terms using Intersection Type assignment systems. In particular, we focus on termination properties, such as strong normalisation, normalisation, head normalisation, and weak head normalisation. We consider also the persistent versions of such notions. By way of example, we consider also another evaluation proper...
متن کاملReducibility proofs in λ-calculi with intersection types
Reducibility has been used to prove a number of properties in the λ-calculus and is well known to offer on one hand very general proofs which can be applied to a number of instantiations, and on the other hand, to be quite mysterious and inflexible. In this paper, we look at two related but different results in λ-calculi with intersection types. We show that one such result (which aims at givin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Structures in Computer Science
سال: 2003
ISSN: 0960-1295,1469-8072
DOI: 10.1017/s0960129502003833